package com.zj.leetcode.hard.dynamicProgramming;

/**
 * @program: algorithm
 * @description:
 * 学生出勤记录 II
 * 552 student-attendance-record-ii
 * @author: Zhang Bo
 * @create: 2022-05-09 10:55:25
 **/
public class StudentAttendanceRecordIi{
    public static void main(String[] args) {
        Solution solution = new StudentAttendanceRecordIi().new Solution();
    }
    //leetcode submit region begin(Prohibit modification and deletion)
    class Solution {
        /**
         * f(n) = f(n-1) + f(n + 2)
         * @param n
         * @return
         */
        public int checkRecord(int n) {
            //TODO 先略过吧
            return 0;
        }
    }
//leetcode submit region end(Prohibit modification and deletion)

}
